Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions address WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, making WSNs more efficient. Unfortunately, still immature, suffering in several aspects. This paper aims solve some of downsides existing protocols for WSNs; a Lightweight Efficient Dynamic Cluster Head Election protocol (LEDCHE-WSN) is proposed. The proposed algorithm comprises two integrated methods, electing optimum cluster head, organizing re-clustering process dynamically. Furthermore, improves on others present literature by combining random periodic method same round, starts first at beginning each round/cycle. Moreover, both methods preceded checking remaining power skip dead nodes continue way periodically with rest round. Additionally, distinguished deleting network topology list during black holes delay problems. Finally, algorithm’s mathematical modeling analysis introduced. experimental results reveal outperforms LEACH approximately 32% FBCFP 8%, terms consumption lifetime. In Mean Package Delay, LEDCHE-WSN 42% 15%, regarding Loss Ratio, it 46% 25%.